The role of the subtropical jet in deficient winter precipitation across the mid-Holocene Indus basin

The mid-Holocene (7-5 ka) was a period with an increased seasonal insolation cycle, resulting from decreased insolation during northern hemisphere winter. Here, a set of six CMIP5 models is used to show that the decreased insolation reduced the upper-tropospheric meridional temperature gradient, producing a weaker subtropical jet with less horizontal shear. These effects work to reduce the baroclinic and barotropic instability available for perturbations to grow, and in consequence, storm-tracking results show that there are fewer winter storms over India and Pakistan (known as western disturbances). These western disturbances are weaker, resulting in a reduction in winter precipitation of around 15% in the north Indus Basin. Combined with previous work showing greater northwestward extent of the Indian monsoon during the mid-Holocene, our GCM-derived results are consistent with the Indus Basin changing from a summer-growing season in the mid-Holocene to a winter-growing season in the present day

Artificial Sequences and Complexity Measures

In this paper we exploit concepts of information theory to address the fundamental problem of identifying and defining the most suitable tools to extract, in a automatic and agnostic way, information from a generic string of characters. We introduce in particular a class of methods which use in a crucial way data compression techniques in order to define a measure of remoteness and distance between pairs of sequences of characters (e.g. texts) based on their relative information content. We also discuss in detail how specific features of data compression techniques could be used to introduce the notion of dictionary of a given sequence and of Artificial Text and we show how these new tools can be used for information extraction purposes. We point out the versatility and generality of our method that applies to any kind of corpora of character strings independently of the type of coding behind them. We consider as a case study linguistic motivated problems and we present results for automatic language recognition, authorship attribution and self consistent-classification.Comment: Revised version, with major changes, of previous "Data Compression approach to Information Extraction and Classification" by A. Baronchelli and V. Loreto. 15 pages; 5 figure

Visual tracking for the recovery of multiple interacting plant root systems from X-ray μCT images

We propose a visual object tracking framework for the extraction of multiple interacting plant root systems from three-dimensional X-ray micro computed tomography images of plants grown in soil. Our method is based on a level set framework guided by a greyscale intensity distribution model to identify object boundaries in image cross-sections. Root objects are followed through the data volume, while updating the tracker's appearance models to adapt to changing intensity values. In the presence of multiple root systems, multiple trackers can be used, but need to distinguish target objects from one another in order to correctly associate roots with their originating plants. Since root objects are expected to exhibit similar greyscale intensity distributions, shape information is used to constrain the evolving level set interfaces in order to lock trackers to their correct targets. The proposed method is tested on root systems of wheat plants grown in soil

An Optimized Interaction Strategy for Bayesian Relevance Feedback

A new algorithm and systematic evaluation is presented for searching a database via relevance feedback. It represents a new image display strategy for the PicHunter system [2, 1]. The algorithm takes feedback in the form of relative judgments ("item A is more relevant than item B") as opposed to the stronger assumption of categorical relevance judgments ("item A is relevant but item B is not"). It also exploits a learned probabilistic model of human behavior to make better use of the feedback it obtains. The algorithm can be viewed as an extension of indexing schemes like the k-d tree to a stochastic setting, hence the name "stochastic-comparison search." In simulations, the amount of feedback required for the new algorithm scales like log 2 |D|, where |D| is the size of the database, while a simple query-by-exampleapproach scales like |D| a , where a < 1 depends on the structure of the database. This theoretical advantage is reflected by experiments with real users on a database of 1500 stock photographs.

Applying analytical functions to define special boundary elements in anelasto-plastic problem with singularities idealized by finite elements

Copy held by FIZ Karlsruhe; available from UB/TIB Hannover / FIZ - Fachinformationszzentrum Karlsruhe / TIB - Technische InformationsbibliothekSIGLEDEGerman